Model Checking Strategic Equilibria
نویسندگان
چکیده
Solution concepts are a fundamental tool for the analysis of game-like systems, and as a consequence, much effort has been devoted to the problem of characterising solution concepts using logic. However, one problem is that, to characterise solution concepts such as Nash equilibrium, it seems necessary to refer to strategies in the object language, which tends to complicate the object language. We propose a logic in which we can formulate important properties of games (and in particular pure-strategy solution concepts) without recourse to naming strategies in the object language. The idea is that instead of using predicates which state that a particular collection of strategies forms a solution, we define formulae of the logic that are true at a state if and only if this state constitutes a particular equilibrium outcome. We demonstrate the usefulness of the logic by model checking equilibria of strategic games.
منابع مشابه
Extended Graded Modalities in Strategy Logic
Strategy Logic (SL) is a logical formalism for strategic reasoning in multi-agent systems. Its main feature is that it has variables for strategies that are associated to specific agents with a binding operator. We introduce Graded Strategy Logic (GRADEDSL), an extension of SL by graded quantifiers over tuples of strategy variables, i.e., “there exist at least g different tuples (x1, ...,xn) of...
متن کاملGraded Strategy Logic: Reasoning about Uniqueness of Nash Equilibria
Strategy Logic (SL) is a well established formalism for strategic reasoning in multi-agent systems. In a nutshell, SL is built over LTL and treats strategies as first-order objects that can be associated with agents by means of a binding operator. In this work we introduce Graded Strategy Logic (GradedSL), an extension of SL by graded quantifiers over tuples of strategy variables such as “there...
متن کاملATL Strategic Reasoning Meets Correlated Equilibrium
This paper is motivated by analysing a Google selfdriving car accident, i.e., the car hit a bus, with the framework and the tools of strategic reasoning by model checking. First of all, we find that existing ATL model checking may find a solution to the accident with irrational joint strategy of the bus and the car. This leads to a restriction of treating both the bus and the car as rational ag...
متن کاملATL with Strategy Contexts and Bounded Memory
We extend the alternating-time temporal logics ATL and ATL with strategy contexts and memory constraints: the first extension makes strategy quantifiers to not “forget” the strategies being executed by the other players. The second extension allows strategy quantifiers to restrict to memoryless or bounded-memory strategies. We first consider expressiveness issues. We show that our logics can ex...
متن کاملInvestigation and Model checking of Algorithms of Eliminations in Game Theory based on Dynamic Epistemic Logic
The core of game theory is looking for the solution of game problems. Various algorithms of iterated elimination are significant for the rapid reduction of game models and seeking reasonable Nash equilibria. The traditional framework of game analysis assumes that game players are Bayesian rational, and that "every player is rational" is common knowledge among the players. However, game theory i...
متن کامل